Multi-Winner Social Choice with Incomplete Preferences
نویسندگان
چکیده
Multi-winner social choice considers the problem of selecting a slate of K options to realize some social objective. It has found application in the construction of political legislatures and committees, product recommendation, and related problems, and has recently attracted attention from a computational perspective. We address the multi-winner problem when facing incomplete voter preferences, using the notion of minimax regret to determine a robust slate of options in the presence of preference uncertainty. We analyze the complexity of this problem and develop new exact and greedy robust optimization algorithms for its solution. Using these techniques, we also develop preference elicitation heuristics which, in practice, allow us to find near-optimal slates with considerable savings in the preference information required vis-à-vis complete votes.
منابع مشابه
Condorcet winners on median spaces
We characterize the outcome of majority voting for single–peaked preferences on median spaces. This large class of preferences covers a variety of multi–dimensional policy spaces including products of lines (e.g. grids), trees, and hypercubes. Our main result is the following: If a Condorcet winner (i.e. a winner in pairwise majority voting) exists, then it coincides with the appropriately defi...
متن کاملStrategic voting in multi-winner elections with approval balloting: a theory for large electorates
We propose a theory of strategic voting in multi-winner elections with approval balloting: A fixed number of candidates are to be elected; each voter votes for as many candidates as she wants; the candidates with the most votes are elected. We assume that voter preferences are separable and that there exists a tiny probability that any vote might be misrecorded. Best responses involve votin...
متن کاملPreference Elicitation and Preference Learning in Social Choice
Social choice has been the subject of intense investigation within computer science, AI, and operations research, in part because of the ease with which preference data from user populations can now be elicited, assessed, or estimated in online settings. In many domains, the preferences of a group of individuals must be aggregated to form a single consensus recommendation, placing us squarely i...
متن کاملConfidence models of incomplete preferences
This paper introduces and axiomatizes a new class of representations for incomplete preferences called confidence models. Confidence models describe decision makers who behave as if they have probabilistic uncertainty over their true preferences, and are only willing to express a binary preference if it is sufficiently likely to hold. Confidence models are flexible enough to model behavior on a...
متن کاملGeneralized stochastic dominance and bad outcome aversion
Incomplete preferences over lotteries on a finite set of alternatives satisfying, besides independence and continuity, a property called bad outcome aversion are considered. These preferences are characterized in terms of their specific multi-expected utility representations (cf. Dubra et al., 2004), and can be seen as generalized stochastic dominance preferences. JEL-classification: C0, D0
متن کامل